Finite connected components of the aliquot graph
نویسندگان
چکیده
منابع مشابه
Finite groups admitting a connected cubic integral bi-Cayley graph
A graph is called integral if all eigenvalues of its adjacency matrix are integers. Given a subset $S$ of a finite group $G$, the bi-Cayley graph $BCay(G,S)$ is a graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid sin S, xin G}$. In this paper, we classify all finite groups admitting a connected cubic integral bi-Cayley graph.
متن کاملStrongly connected components-Algorithm for finding the strongly connected components of a graph
A directed graph G (V, E) is strongly connected if and only if, for any pair of vertices X and Y from V, there exists a path from X to Y and a path from Y to X. In Computer Science, the partition of a graph in strongly connected components is represented by the partition of all vertices from the graph, so that for any two vertices, X and Y, from the same partition, there exists a path from X to...
متن کاملConnected Components of the Graph Generated by Power Maps in Prime Finite Fields
Consider the power pseudorandom-number generator in a finite field Fq. That is, for some integer e ≥ 2, one considers the sequence u, u, ue2 , . . . in Fq for a given seed u ∈ Fq . This sequence is eventually periodic. One can consider the number of cycles that exist as the seed u varies over Fq . This is the same as the number of cycles in the functional graph of the map x 7→ x in Fq . We prov...
متن کاملStrongly Connected Components in Graph Streams
Frequently studied networks, such as social networks, are often massive, directed, and change over time. Thus studying network analysis algorithms in terms of data streaming is a practical model for understanding how companies and other organizations can process data in a useful, realistic way. One potentially interesting feature of a directed graph is strongly connected components. We design a...
متن کاملMaking the components of a graph k-connected
For every integer k 2 and graph G; consider the following natural procedure: if G has a component G0 that is not k-connected, remove G0 if jG0j k, otherwise remove a cutset U V (G0) with jU j < k; do the same with the remaining graph until only k-connected components are left or all vertices are removed. We are interested when this procedure stops after removing o (jGj) vertices. Surprisingly, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2018
ISSN: 0025-5718,1088-6842
DOI: 10.1090/mcom/3299